Average Consensus with Asynchronous Updates and Unreliable Communication
نویسندگان
چکیده
منابع مشابه
Average consensus on networks with quantized communication
This work presents a contribution to the solution of the average agreement problem on a network with quantized links. Starting from the well-known linear diffusion algorithm, we propose a simple and effective adaptation which is able to preserve the average of states and to drive the system near to the consensus value, when a uniform quantization is applied to communication between agents. The ...
متن کاملCommunication constraints in the average consensus problem
The interrelationship between control and communication theory is becoming of fundamental importance in many distributed control systems, such as the coordination of a team of autonomous agents. In such a problem, communication constraints impose limits on the achievable control performance. We consider as instance of coordination the consensus problem. The aim of the paper is to characterize t...
متن کاملthe relationship of wtc with communication apprehension and self-perceived communication competene in english and persian context
بیشتر تحقیقات پیشین در زمینه تمایل به برقراری ارتباط به رابطه آن با عوامل فردی چون سن، جنس، نوع شخصیت و... صورت گرفته است. در صورتی که مطالعات کمتری به بررسی رابطه تمایل به برقراری ارتباط زبان آموزان فارسی زبان با ترس از برقراری ارتباط و توانش خود ادراکانه آنها در برقراری ارتباط در محیط فارسی و انگلیسی انجام شده است. بر اساس نظریه الیس (2008) تمایل به برقراری ارتباط جایگاه مهمی در زمینه آموزش م...
15 صفحه اولAsynchronous Consensus with Bounded Memory
We present here a bounded memory consensus Obstruction-Free algorithm for the asynchronous shared memory model. More precisely for a set of n processes, this algorithm uses n + 1 multi-writer multi-reader (MWMR) registers, each of these registers being of size O(log(n)) bits. Then we get a O(n log(n))-bits size complexity consensus algorithm with single-writer multi-reader (SWMR) registers and ...
متن کاملRandomized Gossip Algorithm with Unreliable Communication
In this paper, we study an asynchronous randomized gossip algorithm under unreliable communication. At each instance, two nodes are selected to meet with a given probability. When nodes meet, two unreliable communication links are established with communication in each direction succeeding with a time-varying probability. It is shown that two particularly interesting cases arise when these comm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2017
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2017.08.093